A rank criterion for QAM space-time codes

نویسندگان

  • Youjian Liu
  • Michael P. Fitz
  • Oscar Y. Takeshita
چکیده

Sufficient conditions to ensure QAM space-time codes achieve full space diversity in quasistatic fading channel are presented. T h e conditions are o n code words or generator matrices instead of on every code word pair. This greatly simplifies the construction of full space diversity codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Rank Criterion for Qam Space-time Codes with Application to Turbo Coding

SufJicient conditions to ensure QAM space-time codes achieve full space diversity in quasi-static fading channel are presented. The conditions are on code words or generator matrices instead of on every code word pair. This simpl@es the check of full space diversity of a code. Based on these conditions, full space diversity parallel concatenated turbo codes are proposed to use in a multiple ele...

متن کامل

Characterization of $2times 2$ full diversity space-time codes and inequivalent full rank spaces

‎In wireless communication systems‎, ‎space-time codes are applied to encode data when multiple antennas are used in the receiver and transmitter‎. ‎The concept of diversity is very crucial in designing space-time codes‎. ‎In this paper‎, ‎using the equivalent definition of full diversity space-time codes‎, ‎we first characterize all real and complex $2times 2$ rate one linear dispersion space-...

متن کامل

Two Generalizations of the Rank-Distance Space-Time Code

Recently Lu and Kumar made use of binary, maximal rank-distance codes to construct space-time codes, which we shall term rank-distance space-time (RDST) codes, over PAM, QAM, and 2-PSK constellations which are optimal under the rate-diversity tradeoff. The RDST code can be regarded as being composed of layers with each layer or component, associated to a maximal-rank binary code. Two generaliza...

متن کامل

Symbol Error Probability of Orthogonal Space-Time Block Codes with QAM in Slow Rayleigh Fading Channel∗

In this paper, using the exact expression for the pairwise error probability derived in terms of the message symbol distance between two message vectors rather than the codeword symbol distance between two transmitted codeword matrices, the exact closed form expressions for the symbol error probability of any linear orthogonal space-time block codes in slow Rayleigh fading channel are derived f...

متن کامل

On the theory of space-time codes for PSK modulation

The design of space–time codes to achieve full spatial diversity over fading channels has largely been addressed by handcrafting example codes using computer search methods and only for small numbers of antennas. The lack of more general designs is in part due to the fact that the diversity advantage of a code is the minimum rank among the complex baseband differences between modulated codeword...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2002